Beyond quantum supremacy: the hunt for useful quantum computers
نویسندگان
چکیده
منابع مشابه
Can Quantum Computers Be Useful When There
Formulation of the problem. Quantum computers (see, e.g., 5]) have a potential of speeding up computations in many important problems. For example: By using Grover's algorithm 3, 4], for any given error probability e 0 , we can search for an item in an n-item (un-sorted) database in (p n) steps (where checking that a given element is the desired one is counted as a single step). By contrast, th...
متن کاملAncilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
Instantaneous quantum polynomial time (IQP) is a model of (probably) non-universal quantum computation. Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the l1 norm, IQP is considered as one of the promising classes that demonstrates quantum supremacy. Although IQP circuits can be realized more easily than a univers...
متن کاملComplexity-Theoretic Foundations of Quantum Supremacy Experiments
In the near future, there will likely be special-purpose quantum computers with 40-50 high-quality qubits. This paper lays general theoretical foundations for how to use such devices to demonstrate “quantum supremacy”: that is, a clear quantum speedup for some task, motivated by the goal of overturning the Extended Church-Turing Thesis as confidently as possible. First, we study the hardness of...
متن کاملUsing Quantum Computers for Quantum Simulation
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulat...
متن کاملAchieving quantum supremacy with sparse and noisy commuting quantum computations
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomialtime) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence of physically motivated constraints. First, we show that there is a family of sparse IQP circuits that can be implemented on a square lattice of n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 2019
ISSN: 0028-0836,1476-4687
DOI: 10.1038/d41586-019-02936-3